Compound Poisson Approximation for Markov Chains using Stein’s Method
نویسندگان
چکیده
منابع مشابه
Translated Poisson approximation for Markov chains
The paper is concerned with approximating the distribution of a sum W of integer valued random variables Yi, 1 ≤ i ≤ n, whose distributions depend on the state of an underlying Markov chain X. The approximation is in terms of a translated Poisson distribution, with mean and variance chosen to be close to those of W , and the error is measured with respect to the total variation norm. Error boun...
متن کاملCompound Poisson Approximation For Dissociated Random Variables Via Stein's Method
In the present paper we consider compound Poisson approximation by Stein’s method for dissociated random variables. We present some applications to problems in system reliability. In particular, our examples have the structure of an incomplete U-statistics. We mainly apply techniques from Barbour and Utev, who gave new bounds for the solutions of the Stein equation in compound Poisson approxima...
متن کاملCompound Poisson process approximation
Compound Poisson processes are often useful as approximate models, when describing the occurrence of rare events. In this paper, we develop a method for showing how close such approximations are. Our approach is to use Stein's method directly, rather than by way of declumping and a marked Poisson process; this has conceptual advantages, but entails technical difficulties. Several applications a...
متن کاملA Compound Poisson Approximation Inequality
We give conditions under which the number of events which occur in a sequence of m-dependent events is stochastically smaller than a suitably defined compound Poisson random variable. The results are applied to counts of sequence pattern appearances and to system reliability. We also provide a numerical example.
متن کاملOn Compound Poisson Approximation For Sequence Matching
Consider the sequences fX i g m i=1 and fY i g n j=1 of independent random variables , which take values in a nite alphabet, and assume that the variables X 1 ; X 2 ; : : : and Y 1 ; Y 2 ; : : : follow the distributions and , respectively. Two variables X i and Y j are said to match if X i = Y j. Let the number of matching subsequences of length k between the two sequences, when r, 0 r < k, mis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1999
ISSN: 0091-1798
DOI: 10.1214/aop/1022677272